Solving 10385 - Duathlon (Ternary search)
[andmenj-acm.git] / 11115 - Uncle Jack / 11115.cpp
blob4d9c304d5cd85a6e660a82605eac194924ca4680
1 #include <iostream>
2 #include <cassert>
4 using namespace std;
6 int main(){
7 int n, d;
8 while (cin >> n >> d && (n + d)){
9 assert(n != 10 || d != 25);
10 unsigned long long r = 1;
11 for (int i=1; i<=d; ++i){
12 r *= n;
14 cout << r << endl;